Logical Reasoning for Higher-Order Functions with Local State
نویسندگان
چکیده
منابع مشابه
Logical Reasoning for Higher-Order Functions with Local State
We introduce an extension of Hoare logic for call-by-value higherorder functions with ML-like local reference generation. Local references may be generated dynamically and exported outside their scope, may store higherorder functions and may be used to construct complex mutable data structures. This primitive is captured logically using a predicate asserting reachability of a reference name fro...
متن کاملOperational Reasoning for Functions with Local State
Languages such as ML or Lisp permit the use of recursively defined function expressions with locally declared storage locations. Although this can be very convenient from a programming point of view it severely complicates the properties of program equivalence even for relatively simple fragments of such languages—such as the simply typed fragment of Standard ML with integer-valued references c...
متن کاملLocal State in Hoare Logic for Imperative Higher-Order Functions
We introduce an extension of Hoare logic for imperative higher-order functions with local state. Local state may be generated dynamically and exported outside its scope, may store higher-order functions, and may be used to construct complex shared mutable data structures. The induced behaviour is captured with a first order predicate which asserts reachability of reference names. The logic enjo...
متن کاملReasoning with Higher Order Partial Functions
In this paper we introduce the logic P HOL, which embodies higher-order functions through a simply-typed-calculus and deals with partial objects by using partially ordered domains and three truth values. We deene a refutationally complete tableaux method for P HOL and we show how to derive a sound and complete cut free sequent calculus through a systematic analysis of the rules for tableaux con...
متن کاملLogics for Imperative Higher-Order Functions with Aliasing and Local State: Thee Completeness Results
We establish three completeness properties (descriptive, relative and observational completeness) for the program logic for aliasing and higher-order functions, first studied in [1]. We then extend the results to the logic with local state in [6].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2008
ISSN: 1860-5974
DOI: 10.2168/lmcs-4(4:2)2008